Visualizing Dynamic Call Graphs

نویسندگان

  • Michael Burch
  • Christoph Müller
  • Guido Reina
  • Hansjörg Schmauder
  • Miriam Greis
  • Daniel Weiskopf
چکیده

Visualizing time-varying call graphs is challenging due to vast amounts of data at many dimensions to be displayed: Hierarchically organized vertices with attributes, directed or undirected edges with weights, and time. In this paper, we introduce a novel overview representation that shows dynamic graphs as a timelineand pixelbased aggregated view targeting the preservation of a viewer’s mental map by encoding the time-varying data into a static diagram. This view allows comparisons of dynamic call graphs on different levels of hierarchical granularity. Our data extraction and visualization system uses this overview as a starting point for further investigations by applying existing dynamic graph visualization techniques that show the graph structures and properties more clearly. These more task-specific visualizations show the dynamic graph data from different perspectives such as curved node-link diagrams or glyph-based representations combined by linking and brushing. Intermediate analysis steps can be stored and rebuilt at any time by using corresponding thumbnail representations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visualizing a Sequence of a Thousand Graphs (or Even More)

The visualization of dynamic graphs demands visually encoding at least three major data dimensions: vertices, edges, and time steps. Many of the state-of-the-art techniques can show an overview of vertices and edges but lack a data-scalable visual representation of the time aspect. In this paper, we address the problem of displaying dynamic graphs with a thousand or more time steps. Our propose...

متن کامل

Radial Edge Splatting for Visualizing Dynamic Directed Graphs

We describe and discuss a novel radial version of a scalable dynamic graph visualization. The radial layout encodes dynamic directed graphs on narrow rings of a circle. The temporal evolution of the graph is mapped to rings that grow outward from the center of the circle. Graph vertices are placed equidistantly at the borderlines of each ring. Graph edges are displayed as curved lines starting ...

متن کامل

J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode

We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, which we call the siblingfirst recursive (SFR) numbering. The particular graphs we consider are derived from applying Shiver’s k-CFA framework to Java bytecode, and our visualizer includes helpful links between the node...

متن کامل

An Overview of Visualizing Dynamic Graphs

Dynamic graphs are graphs that represent networks that have a time-varying component. A great deal of processes in the world can be modeled as such graphs but cannot be modeled as their static counterparts. This paper discusses the approaches that have been proposed in the literature to visualize these dynamic graphs and the applications which they have been used for. This paper intends to prov...

متن کامل

Visualizing Large Dynamic Digraphs

In this paper we investigate the problem of visually representing large dynamic directed graphs with many vertices, edges, and time steps. With this work we do not primarily focus on graph details but more on achieving an overview about long graph sequences with the major focus to be scalable in vertex, edge, and time dimensions. To reach this goal we first map each graph to a bipartite layout ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012